Using Mixture of Experts Method in Combining Search-Guiding Heuristics for Theorem Proving
نویسندگان
چکیده
The main challenge of automated theorem proving is to find a way to shorten the search process. Therefore using a good heuristic method is essential. Instead of constructing a heuristic from scratch, we propose to use the mixture of experts learning to combine the existing heuristics to construct a heuristic from similar problems. The results show that the combined heuristic is better than each individual heuristic used in combination.
منابع مشابه
Fakult at F Ur Informatik Der Technischen Universitt at M Unchen Lehrstuhl Viii Forschungsgruppe Automated Reasoning Feature-based Learning of Search-guiding Heuristics for Theorem Proving Feature-based Learning of Search-guiding Heuristics for Theorem Proving
b b b b b b b b b b b b b b b b b b b Abstract Automated reasoning or theorem proving essentially amounts to solving search problems. Despite signiicant progress in recent years theorem provers still have many shortcomings. The use of machine-learning techniques is acknowledged as promising, but diicult to apply in the area of theorem proving. We propose here to learn search-guiding heuristics ...
متن کاملFeature-Based Learning of Search-Guiding Heuristics for Theorem Proving
b b b b b b b b b b b b b b b b b b b Abstract Automated reasoning or theorem proving essentially amounts to solving search problems. Despite signiicant progress in recent years theorem provers still have many shortcomings. The use of machine-learning techniques is acknowledged as promising, but diicult to apply in the area of theorem proving. We propose here to learn search-guiding heuristics ...
متن کاملAutomatic Selection of Search-guiding Heuristics for Theorem Proving
Theorem proving essentially amounts to solving search problems. The intricacy of these in general undecidable problems makes the use of appropriate search-guiding heuristics indispensable. However, the appropriateness of a heuristic critically depends on the problem to be solved. Given a set of heuristics to choose from, selecting a suitable heuristic is hence a crucial, but also a very diicult...
متن کاملA Feature-Based Learning Method for Theorem Proving
Automated reasoning or theorem proving essentially amounts to solving search problems. Despite significant progress in recent years theorem provers still have many shortcomings. The use of machine-learning techniques is acknowledged as promising, but difficult to apply in the area of theorem proving. We propose here to learn search-guiding heuristics by employing features in a simple, yet effec...
متن کاملInternal Strategies in a Reeective Logic Strategies and Rewriting in Elan Tacticals in Ilf -and Why They Are Superruous Bernd Ingo Dahn 1.40pm -2.10pm Break Session 2: Strategy Analysis 2.10pm -2.40pm Strategies for Logic Programming Languages
i Preface The concept of strategy allows describing and guiding computations and deductions in automated theorem provers, proof checkers, logical frameworks. Strategies are used for various purposes, e.g. for-proof search in theorem proving,-combining diierent proof techniques and computation paradigms,-program transformation,-developing heuristics for playing games and nding proofs. Rules are ...
متن کامل